Multiobjective Hierarchical 2G/3G Mobility Management Optimization: Niched Pareto Genetic Algorithm

نویسندگان

  • Timucin Ozugur
  • Falguni Sarkar
چکیده

In this paper, we first propose four-layer optimization for UMTS coverage area: (i) cell-oriented intra-SGSN layer, which is optimized RA areas covering the intra-SGSN signaling cost, paging cost and RA load balancing, (ii) RA-oriented intra-MSC layer, which is optimized location areas covering the intra-MSC signaling cost and LA load balancing,(iii) RA-oriented inter-SGSN layer, which is optimized SGSN coverage areas covering the inter-SGSN signaling cost, RNC and SGSN load balancing, (iv) LA-oriented inter-MSC layer, which is optimized MSC coverage areas covering the inter-MSC signaling cost and MSC load balancing. In this paper, we focus on the RA optimization, namely layers (i) and (iii). The optimization of MSC coverage areas and LAs is performed in a similar manner. We propose a schema-based niched Pareto genetic algorithm, which deals with multiple objectives by incorporating the concept of Pareto domination in its selection operator, and applying a niching pressure to spread its population out along the Pareto optimal tradeoff surface. The proposed genetic algorithm uses a schema-based partially matching crossover using tournaments of n size, where the crossover pairs are chosen in two steps, first based on the class ranking and then schema ranking. New offsprings are modified using the geographical footprints to converge to the optimal solution faster.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fuzzy Logic vs . Niched Pareto Multiobjective Genetic Algorithm Optimization : Part II : A Simplified Born - Mayer Problem

A new multiobjective selection procedure for Genetic Algorithms based on the paradigms of fuzzy logic is discussed and compared to the niched Pareto selection procedure. In the example presented here the fuzzy logic procedure optimized the parameters of a series of functions in a more efficient manner than the niched Pareto approach. The main advantage that the fuzzy logic approach has over the...

متن کامل

A niched genetic algorithm to solve a pollutant emission reduction problem in the manufacturing industry: A case study

A multiobjective optimization approach to deal with a pollutant emission reduction problem in the manufacturing industry, through implementation of the best available technical options, is presented in this paper. More specifically, attention is focused on the industrial painting of wood and the problem under investigation is formulated as a bicriteria combinatorial optimization problem. A nich...

متن کامل

Using Multiobjective Genetic Programming to Infer Logistic Polynomial Regression Models

In designing non-linear classifiers, there are important trade-offs to be made between predictive accuracy and model comprehensibility or complexity. We introduce the use of Genetic Programming to generate logistic polynomial models, a relatively comprehensible non-linear parametric model; describe an efficient twostage algorithm consisting of GP structure design and Quasi-Newton coefficient se...

متن کامل

The Pareto Archived Evolution Strategy : A New Baseline Algorithm for Pareto Multiobjective Optimisation

Most popular evolutionary algorithms for multiobjective optimisation maintain a population of solutions from which individuals are selected for reproduction. In this paper, we introduce a simpler evolution scheme for multiobjective problems, called the Pareto Archived Evolution Strategy (PAES). We argue that PAES may represent the simplest possible non-trivial algorithm capable of generating di...

متن کامل

A Niched Pareto Genetic Algorithm for Multiobjective Optimization

| Many, if not most, optimization problems have multiple objectives. Historically , multiple objectives have been combined ad hoc to form a scalar objective function , usually through a linear combination (weighted sum) of the multiple attributes, or by turning objectives into constraints. The genetic algorithm (GA), however, is readily modiied to deal with multiple objectives by incorporating ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001